Zero-Inertia Limit: From Particle Swarm Optimization to Consensus-Based Optimization
نویسندگان
چکیده
Recently a continuous description of particle swarm optimization (PSO) based on system stochastic differential equations was proposed by Grassi and Pareschi in [Math. Models Methods Appl. Sci., 31 (2021), pp. 1625--1657] where the authors formally showed link between PSO consensus-based (CBO) through zero-inertia limit. This paper is devoted to solving this theoretical open problem [S. L. Pareschi, Math. providing rigorous derivation CBO from limit zero inertia, quantified convergence rate obtained as well. The proofs are probabilistic approach investigating both weak strong corresponding Mckean type path space results illustrated with some numerical examples.
منابع مشابه
Chaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملParticle Swarm Optimization Based Reactive Power Optimization
Reactive power plays an important role in supporting the real power transfer by maintaining voltage stability and system reliability. It is a critical element for a transmission operator to ensure the reliability of an electric system while minimizing the cost associated with it. The traditional objectives of reactive power dispatch are focused on the technical side of reactive support such as ...
متن کاملDynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles
Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dyn...
متن کاملA Novel Flexible Inertia Weight Particle Swarm Optimization Algorithm
Particle swarm optimization (PSO) is an evolutionary computing method based on intelligent collective behavior of some animals. It is easy to implement and there are few parameters to adjust. The performance of PSO algorithm depends greatly on the appropriate parameter selection strategies for fine tuning its parameters. Inertia weight (IW) is one of PSO's parameters used to bring about a balan...
متن کاملComparing Inertia Weights and Constriction Factors in Particle Swarm Optimization
The performance of particle swarm optimization using an inertia weight is compared with performance using a constriction factor. Five benchmark functions are used for the comparison. It is concluded that the best approach is to use the constriction factor while limiting the maximum velocity Vmax to the dynamic range of the variable Xmax on each dimension. This approach provides performance on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Mathematical Analysis
سال: 2022
ISSN: ['0036-1410', '1095-7154']
DOI: https://doi.org/10.1137/21m1412323